On complete strongly connected digraphs with the least number of 3-cycles
نویسندگان
چکیده
منابع مشابه
On spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملThe strongly connected reliability of complete digraphs
Given a digraph D, consider the model where each vertex is always operational, but the edges are independently operational with probability p. The strongly connected reliability of D, scRel(D, p), is the probability that the spanning subgraph of D consisting of the operational edges is strongly connected. One can view strongly connected reliability as the probability that any vertex can send in...
متن کاملThe number of h-strongly connected digraphs with small diameter
Let D s (n; h, d = k) denote the number of h-strongly connected digraphs of order n and diameter equal to k. In this paper it is shown that: i) Ds(n; 11" d = 3) = 4(~) (3/4 + o(I))n for every fixed h ;::: 1; ii) Ds(n; h, d = 4) = 4(~) (2h 2 + 2-2 + o(I))n for every fixed h ;::: 2; iii) Ds(n; 11" d = k) = 4(~) ((2h+l I)2-kh+:3h-2 + o(I))n for every fixed h ;::: 1 and k ;::: 5. Similar asymptotic...
متن کاملBispindle in strongly connected digraphs with large chromatic number
A (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al. showed that for every (1, 1)bispindle B, there exists an integer k such that every strongly connected digraph with chromatic number greater than k contains a subdivision of B. We investigate generalisations of this result by first showing co...
متن کاملon spectral radius of strongly connected digraphs
it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00366-q